On separable self-complementary graphs

On separable self-complementary graphs

In this paper, we describe the structure of separable self-complementary graphs. c © 2002 Elsevier Science B.V. All rights reserved.

On almost self-complementary graphs

A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc − I, where Xc denotes the complement of X and I a perfect matching (1-factor) in Xc. Almost self-complementary circulant graphs were first studied by Dobson and Šajna in 2004. In this paper we investigate some of the properties and constructions of general almost self-complementary graphs. In par...

Self-complementary circulant graphs

On the structure of self-complementary graphs

A graph G is self complementary if it is isomorphic to its complement G. In this paper we define bipartite self-complementary graphs, and show how they can be used to understand the structure of self-complementary graphs. For G a selfcomplementary graph of odd order, we describe a decomposition of G into edge disjoint subgraphs, one of which is a bipartite self-complementary graph of order |G|−...

Self-Complementary Vertex-Transitive Graphs

A graph Γ is self-complementary if its complement is isomorphic to the graph itself. An isomorphism that maps Γ to its complement Γ is called a complementing isomorphism. The majority of this dissertation is intended to present my research results on the study of self-complementary vertex-transitive graphs. I will provide an introductory mini-course for the backgrounds, and then discuss four pr...